/*
 * Copyright 2010 Michael Nitsche
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

package de.mnit.basis.daten.struktur.ordnen;

import de.mnit.basis.daten.struktur.ordnen.algo.Gnomesort;
import de.mnit.basis.daten.struktur.ordnen.algo.Mergesort;
import de.mnit.basis.fehler.Fehler;

/**
 * @author Michael Nitsche
 * 26.11.2010	Erstellt
 */
public class Sortieren {

	private static final Gnomesort	gnome	= new Gnomesort();
	private static final Mergesort	merge	= new Mergesort();


	public static void sortieren(S_Sortierbar<?> tab, int... nach) {
		Fehler.objekt.wenn_Null(tab);
		if(nach==null || nach.length==0)
			nach=new int[]{1};
		for(int i : nach)
			Fehler.zahl.wenn_Ausserhalb(1, tab.gBreite(), Math.abs(i));

		if(tab.gLaenge() <= 10) // Macht aber nur sehr wenig aus. Evtl. macht diese Abfrage schon das Plus kaputt!
			gnome.sortieren(tab, nach);
		else
			merge.sortieren(tab, nach);
		return;
	}

}
